Novel pseudo-random number generator based on quantum random walks
نویسندگان
چکیده
In this paper, we investigate the potential application of quantum computation for constructing pseudo-random number generators (PRNGs) and further construct a novel PRNG based on quantum random walks (QRWs), a famous quantum computation model. The PRNG merely relies on the equations used in the QRWs, and thus the generation algorithm is simple and the computation speed is fast. The proposed PRNG is subjected to statistical tests such as NIST and successfully passed the test. Compared with the representative PRNG based on quantum chaotic maps (QCM), the present QRWs-based PRNG has some advantages such as better statistical complexity and recurrence. For example, the normalized Shannon entropy and the statistical complexity of the QRWs-based PRNG are 0.999699456771172 and 1.799961178212329e-04 respectively given the number of 8 bits-words, say, 16Mbits. By contrast, the corresponding values of the QCM-based PRNG are 0.999448131481064 and 3.701210794388818e-04 respectively. Thus the statistical complexity and the normalized entropy of the QRWs-based PRNG are closer to 0 and 1 respectively than those of the QCM-based PRNG when the number of words of the analyzed sequence increases. It provides a new clue to construct PRNGs and also extends the applications of quantum computation.
منابع مشابه
A Pseudo Random Number Generator Based on Chaotic Billiards
The systems of chaotic billiards revealed a well developed chaotic behavior. Despite its good characteristics, these systems have not yet been applied to the cryptography; among the reasons is the difficulty of expressing the equation of particle motion in an explicit form. In this work, we took advantage the properties offered by the random walks and unpredictability of two particles moving in...
متن کاملDesign of low power random number generators for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA. Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...
متن کاملDesign of low power random number generators for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA. Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...
متن کاملA Novel Pseudo Random Number Generator Based on Two Plasmonic Maps
In plasmonic systems, the response of nanoobjects under light illumination can produce complex optical maps. Such plasmonic or resonant systems have interesting characteristics such as sensitivity on parameters and initial conditions. In this paper, we show how these complex maps can be cryptographically improved and associated in order to design a secure pseudo random number generator.
متن کاملA Fast Chaos-Based Pseudo-Random Bit Generator Using Binary64 Floating-Point Arithmetic
Chaos-based cryptography is widely investigated in recent years, especially in the field of random number generators. The paper describes a novel pseudo-random bit generator (PRBG) based on chaotic logistic maps. Three logistic maps are combined in the algorithmic process, and a block of 32 random bits is produced at each iteration. The binary64 double precision format is used according to the ...
متن کامل